Mi manual de algoritmos/version_maraton_interuniversitaria_2008-2/manual.aux

   1 \relax
   2 \catcode`.\active
   3 \catcode`\.=12
   4 \catcode`"\active
   5 \catcode`<\active
   6 \catcode`>\active
   7 \es@quoting
   8 \ifx\hyper@anchor\@undefined
   9 \global \let \oldcontentsline\contentsline
  10 \gdef \contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
  11 \global \let \oldnewlabel\newlabel
  12 \gdef \newlabel#1#2{\newlabelxx{#1}#2}
  13 \gdef \newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
  14 \AtEndDocument{\let \contentsline\oldcontentsline
  15 \let \newlabel\oldnewlabel}
  16 \else
  17 \global \let \hyper@last\relax
  18 \fi
  19
  20 \select@language{spanish}
  21 \@writefile{toc}{\select@language{spanish}}
  22 \@writefile{lof}{\select@language{spanish}}
  23 \@writefile{lot}{\select@language{spanish}}
  24 \@writefile{toc}{\contentsline {section}{\numberline {1}Teor\IeC {\'\i }a de n\IeC {\'u}meros}{2}{section.1}}
  25 \@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Big mod}{2}{subsection.1.1}}
  26 \@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Criba de Erat\IeC {\'o}stenes}{2}{subsection.1.2}}
  27 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3}Divisores de un n\IeC {\'u}mero}{3}{subsection.1.3}}
  28 \@writefile{toc}{\contentsline {section}{\numberline {2}Combinatoria}{3}{section.2}}
  29 \@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Cuadro resumen}{3}{subsection.2.1}}
  30 \@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Combinaciones, coeficientes binomiales, tri\IeC {\'a}ngulo de Pascal}{3}{subsection.2.2}}
  31 \@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Permutaciones con elementos indistinguibles}{4}{subsection.2.3}}
  32 \@writefile{toc}{\contentsline {subsection}{\numberline {2.4}Desordenes, desarreglos o permutaciones completas}{4}{subsection.2.4}}
  33 \@writefile{toc}{\contentsline {section}{\numberline {3}Grafos}{4}{section.3}}
  34 \@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Algoritmo de Dijkstra}{4}{subsection.3.1}}
  35 \@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Minimum spanning tree: Algoritmo de Prim}{5}{subsection.3.2}}
  36 \@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Minimum spanning tree: Algoritmo de Kruskal + Union-Find}{6}{subsection.3.3}}
  37 \@writefile{toc}{\contentsline {subsection}{\numberline {3.4}Algoritmo de Floyd-Warshall}{7}{subsection.3.4}}
  38 \@writefile{toc}{\contentsline {subsection}{\numberline {3.5}Algoritmo de Bellman-Ford}{8}{subsection.3.5}}
  39 \@writefile{toc}{\contentsline {subsection}{\numberline {3.6}Puntos de articulaci\IeC {\'o}n}{9}{subsection.3.6}}
  40 \@writefile{toc}{\contentsline {subsection}{\numberline {3.7}M\IeC {\'a}ximo flujo: M\IeC {\'e}todo de Ford-Fulkerson, algoritmo de Edmonds-Karp}{10}{subsection.3.7}}
  41 \@writefile{toc}{\contentsline {section}{\numberline {4}Programaci\IeC {\'o}n din\IeC {\'a}mica}{11}{section.4}}
  42 \@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Longest common subsequence}{11}{subsection.4.1}}
  43 \@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Partici\IeC {\'o}n de troncos}{12}{subsection.4.2}}
  44 \@writefile{toc}{\contentsline {section}{\numberline {5}Geometr\IeC {\'\i }a}{13}{section.5}}
  45 \@writefile{toc}{\contentsline {subsection}{\numberline {5.1}\IeC {\'A}rea de un pol\IeC {\'\i }gono}{13}{subsection.5.1}}
  46 \@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Centro de masa de un pol\IeC {\'\i }gono}{14}{subsection.5.2}}
  47 \@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Convex hull: Graham Scan}{14}{subsection.5.3}}
  48 \@writefile{toc}{\contentsline {subsection}{\numberline {5.4}Convex hull: Andrew's monotone chain}{16}{subsection.5.4}}
  49 \@writefile{toc}{\contentsline {subsection}{\numberline {5.5}M\IeC {\'\i }nima distancia entre un punto y un segmento}{17}{subsection.5.5}}
  50 \@writefile{toc}{\contentsline {subsection}{\numberline {5.6}M\IeC {\'\i }nima distancia entre un punto y una recta}{17}{subsection.5.6}}
  51 \@writefile{toc}{\contentsline {subsection}{\numberline {5.7}Determinar si un pol\IeC {\'\i }gono es convexo}{17}{subsection.5.7}}
  52 \@writefile{toc}{\contentsline {subsection}{\numberline {5.8}Determinar si un punto est\IeC {\'a} dentro de un pol\IeC {\'\i }gono convexo}{18}{subsection.5.8}}
  53 \@writefile{toc}{\contentsline {subsection}{\numberline {5.9}Determinar si un punto est\IeC {\'a} dentro de un pol\IeC {\'\i }gono cualquiera}{18}{subsection.5.9}}
  54 \@writefile{toc}{\contentsline {section}{\numberline {6}Miscel\IeC {\'a}neo}{20}{section.6}}
  55 \@writefile{toc}{\contentsline {subsection}{\numberline {6.1}El \textit  {parser} m\IeC {\'a}s r\IeC {\'a}pido del mundo}{20}{subsection.6.1}}
  56 \@writefile{toc}{\contentsline {section}{\numberline {7}Java}{21}{section.7}}
  57 \@writefile{toc}{\contentsline {subsection}{\numberline {7.1}Entrada desde entrada est\IeC {\'a}ndar}{21}{subsection.7.1}}
  58 \@writefile{toc}{\contentsline {subsection}{\numberline {7.2}Entrada desde archivo}{22}{subsection.7.2}}
  59 \@writefile{toc}{\contentsline {subsection}{\numberline {7.3}Mapas y sets}{23}{subsection.7.3}}
  60 \@writefile{toc}{\contentsline {subsection}{\numberline {7.4}Colas de prioridad}{24}{subsection.7.4}}
  61 \newlabel{colas_de_prioridad_java}{{7.4}{24}{Colas de prioridad\relax }{subsection.7.4}{}}
  62 \@writefile{toc}{\contentsline {section}{\numberline {8}C++}{25}{section.8}}
  63 \@writefile{toc}{\contentsline {subsection}{\numberline {8.1}Entrada desde archivo}{25}{subsection.8.1}}
  64 \@writefile{toc}{\contentsline {subsection}{\numberline {8.2}Strings con caract\IeC {\'e}res especiales}{26}{subsection.8.2}}